Adoption of Indigenous Dairy Management Practices among Tribal Farm Women

The study was conducted among the tribal farm women of West Garo Hills District of Meghalaya, India with the objective to determine the extent of adoption of indigenous dairy management practices. Proportionate random sampling was used in selection of 120 respondents. Practices having rationality for adoption of indigenous dairy management practices were collected and the data were analyzed using percentage analysis. The findings revealed that majority of the respondents adopted care and management of dry and pregnant cows. This was followed by adoption of other practices viz.., selection of breed and feeding, care during and after calving and milking technique

Hidden Translation and Translating Coset in Quantum Computing

We give efficient quantum algorithms for the problems of Hidden Translation and Hidden Subgroup in a large class of non-abelian solvable groups including solvable groups of constant exponent and of constant length derived series. Our algorithms are recursive. For the base case, we solve efficiently Hidden Translation in $\Z_{p}^{n}$, whenever $p$ is a fixed prime. For the induction step, we introduce the problem Translating Coset generalizing both Hidden Translation and Hidden Subgroup, and prove a powerful self-reducibility result: Translating Coset in a finite solvable group $G$ is reducible to instances of Translating Coset in $G/N$ and $N$, for appropriate normal subgroups $N$ of $G$. Our self-reducibility framework combined with Kuperberg's subexponential quantum algorithm for solving Hidden Translation in any abelian group, leads to subexponential quantum algorithms for Hidden Translation and Hidden Subgroup in any solvable group.Comment: Journal version: change of title and several minor update

On Solving Systems of Diagonal Polynomial Equations Over Finite Fields

We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the polynomial equations. Our algorithm works in time polynomial in the number of equations and the logarithm of the size of the field, whenever the degree of the polynomial equations is constant. As a consequence we design polynomial time quantum algorithms for two algebraic hidden structure problems: for the hidden subgroup problem in certain semidirect product p-groups of constant nilpotency class, and for the multi-dimensional univariate hidden polynomial graph problem when the degree of the polynomials is constant.Comment: A preliminary extended abstract of this paper has appeared in Proceedings of FAW 2015, Springer LNCS vol. 9130, pp. 125-137 (2015

P\'olya number of continuous-time quantum walks

We propose a definition for the P\'olya number of continuous-time quantum walks to characterize their recurrence properties. The definition involves a series of measurements on the system, each carried out on a different member from an ensemble in order to minimize the disturbance caused by it. We examine various graphs, including the ring, the line, higher dimensional integer lattices and a number of other graphs and calculate their P\'olya number. For the timing of the measurements a Poisson process as well as regular timing are discussed. We find that the speed of decay for the probability at the origin is the key for recurrence.Comment: 8 pages, no figures. Accepted for publication in Physical Review

Weak Parity

We study the query complexity of Weak Parity: the problem of computing the parity of an n-bit input string, where one only has to succeed on a 1/2+eps fraction of input strings, but must do so with high probability on those inputs where one does succeed. It is well-known that n randomized queries and n/2 quantum queries are needed to compute parity on all inputs. But surprisingly, we give a randomized algorithm for Weak Parity that makes only O(n/log^0.246(1/eps)) queries, as well as a quantum algorithm that makes only O(n/sqrt(log(1/eps))) queries. We also prove a lower bound of Omega(n/log(1/eps)) in both cases; and using extremal combinatorics, prove lower bounds of Omega(log n) in the randomized case and Omega(sqrt(log n)) in the quantum case for any eps>0. We show that improving our lower bounds is intimately related to two longstanding open problems about Boolean functions: the Sensitivity Conjecture, and the relationships between query complexity and polynomial degree.Comment: 18 page

Some aspects of experimental culture of the oyster Crassostrea madrasensis(Preston)

Settlement and rate of growth of the oyster Crassostrea madrasensis (Prastcm) wwe studied at the Mulki Estuary, Dakshina Kannada. The breeding season extends from October to May. Peak Settlement of spat takes place during November-December and March-April. Of the several cultch materials tried, oyster shell, used automobile tyres, rigid PVC, lime-coated tiles and asbestos were found to be suitable. Cultch smeared with crude extracts of oyster tissiM supported more spat per unit area than the untreated panels. Tliespjt grew initially at the rate of 2-3 cm per month. Spat transferaed to suspmded wire bag grew faster than the feral ones. The oysters attained^ 7.0 cm shell-height in about 7 months. The size at fiiBt maturity was 12-14 mm for males and 24-26 mm for females^ Study of 4he condition and edibility indicies showed that die best season for harvest is May-September

Feeding habits of the Pearl-Spot Etroplus suratensis (Bloch) in the Nethravati - Gurpur estuary

Occurrence of decayed organic matter in the stomach showed seasonal variations which were related to relative abundance of food, selectivity, age and diurnal variations in feeding. Filamentous algae Spirogyra fonned an important item of the diet in November. A change in diet with increase in size of fish was noticed. While fish of 8 em T L preferred decayed organic matter and microvegetation, larger fish fed on a variety of food. Increased occurrence of sand grains in larger fish suggests habitual bottom feeding. Intensive feeding was noticed in early mature and spent fish. Feeding intensity appears to be related to spawning activity, besides food abundance

Reproduction of the Pearl-Spot, Etroplus suratensis (Bloch) in the Nethravati - Gurpur Estuary, Mangalore

Spawning of Etroplus suratensis in the Nethravati•Gurpur estuary took place from August to November and January to February with peak activity during August. The male: female ratio was 1 : 2.73, indicating a significant dominance of females in the population. Up to size group 18 - 19 em T L., the females dominated. In the larger individuals there was no significant difference in the ratio

Searching via walking: How to find a marked subgraph of a graph using quantum walks

We show how a quantum walk can be used to find a marked edge or a marked complete subgraph of a complete graph. We employ a version of a quantum walk, the scattering walk, which lends itself to experimental implementation. The edges are marked by adding elements to them that impart a specific phase shift to the particle as it enters or leaves the edge. If the complete graph has N vertices and the subgraph has K vertices, the particle becomes localized on the subgraph in O(N/K) steps. This leads to a quantum search that is quadratically faster than a corresponding classical search. We show how to implement the quantum walk using a quantum circuit and a quantum oracle, which allows us to specify the resource needed for a quantitative comparison of the efficiency of classical and quantum searches -- the number of oracle calls.Comment: 4 pages, 2 figure

Quantum search algorithms on a regular lattice

Quantum algorithms for searching one or more marked items on a d-dimensional lattice provide an extension of Grover's search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms of the level dynamics near an avoided crossing of a one-parameter family of quantum random walks. We give approximations for both the level-splitting at the avoided crossing and the effectively two-dimensional subspace of the full Hilbert space spanning the level crossing. This makes it possible to give the leading order behaviour for the search time and the localisation probability in the limit of large lattice size including the leading order coefficients. For d=2 and d=3, these coefficients are calculated explicitly. Closed form expressions are given for higher dimensions